Rapidly Mixing Random Walks and Bounds on Characters of the Symmetric Group
نویسندگان
چکیده
منابع مشابه
Rapidly Mixing Random Walks and Bounds on Characters of the Symmetric Group
We investigate mixing of random walks on Sn and An generated by permutations of a given cycle structure. The approach follows methods developed by Diaconis, which requires certain estimates on characters of the symmetric group and uses combinatorics of Young tableaux. We conclude with conjectures and open problems.
متن کاملDeterministic Random Walks for Rapidly Mixing Chains
The rotor-router model, also known as the Propp machine, is a deterministic process analogous to a random walk on a graph. Instead of distributing tokens to randomly chosen neighbors, the rotor-router deterministically serves the neighbors in a fixed order. This paper is concerned with a generalized model, functional-router model. While the rotor-router is an analogy with a random walk consisti...
متن کاملon translation of phatic communion and socio-cultural relationships between the characters of the novels
phatic communion is a cultural concept which differs across cultures. according to hofstede (2001), the u.s. tends to have individualistic culture; however, asian countries tend to have collectivistic cultures. these cultures view phatic communion differently. in individualistic cultures like u.s., phatic communion reflects speakers’ socio-cultural relationships in conversations. to see whether...
15 صفحه اولRandom walks on finite groups and rapidly mixing Markov chains
© Springer-Verlag, Berlin Heidelberg New York, 1983, tous droits réservés. L’accès aux archives du séminaire de probabilités (Strasbourg) (http://www-irma. u-strasbg.fr/irma/semproba/index.shtml), implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Tout...
متن کاملRandom Rotations: Characters and Random Walks on SO(N)
We analyze a random walk on the orthogonal group SO(N) given by repeatedly rotating by a fixed angle through randomly chosen planes of R . We derive estimates of the rate at which this random walk will converge to Haar measure on SO(N), using character theory and the Upper Bound Lemma of Diaconis and Shashahani. In some cases we are able to establish the existence of a “cut-off phenomenon” for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2002
ISSN: 0925-9899
DOI: 10.1023/a:1021172928478